An Eulerian Partner for Inversions
نویسنده
چکیده
A number of researchers studying permutation statistics on the symmetric group Sn have considered pairs (x, Y), where x is an Eulerian statistic and Y is a Mahonian statistic. Of special interest are pairs such as (des, maj), whose joint distribution on Sn is given by Carlitz’s q-Eulerian polynomials. We present a natural Eulerian statistic stc such that the pair (stc, inv) is equally distributed with (des, maj) on Sn, and provide a simple bijective proof of this fact. This result solves the problem of finding an Eulerian partner for the Mahonian statistic inv. We conjecture several properties of the joint distributions of stc with the statistics des and maj.
منابع مشابه
Symmetric unimodal expansions of excedances in colored permutations
We consider several generalizations of the classical γ-positivity of Eulerian polynomials using generating functions and combinatorial theory of continued fractions. For the symmetric group, we prove an expansion formula for inversions and excedances as well as a similar expansion for derangements. We also prove the γ-positivity for Eulerian polynomials of type B and for Eulerian polynomials of...
متن کاملCombinatorial study on the group of parity alternating permutations
The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian numbers have intimate relationships to the set.
متن کاملGeneralized Worpitzky Identities with Applications to Permutation Enumeration
The enumeration of permutations by inversions often leads to a q-analog of the usual generating 'nnetic,n. In this paper, two generalizations of the Worpitzky identity for the Eulerian numbers are obtained and used to enumerate permutations by the descent number and the major index of their inverses. The resulting (t, q)-generating series do in fact generalize the q-series obtainc? when countin...
متن کاملCombinatorics in the group of parity alternating permutations
We call a permutation parity alternating, if its entries assume even and odd integers alternately. Parity alternating permutations form a subgroup of the symmetric group. This paper deals with such permutations classified by two permutation statistics; the numbers of ascents and inversions. It turns out that they have a close relationship to signed Eulerian numbers. The approach is based on a s...
متن کاملRefined Inversion Statistics on Permutations
We introduce and study new refinements of inversion statistics for permutations, such as k-step inversions, (the number of inversions with fixed position differences) and non-inversion sums (the sum of the differences of positions of the non-inversions of a permutation). We also provide a distribution function for non-inversion sums, a distribution function for k-step inversions that relates to...
متن کامل